PathGame: Crowdsourcing Time-Constrained Human Solutions for the Travelling Salesperson Problem
نویسندگان
چکیده
منابع مشابه
Travelling Salesperson Problem for Dynamic Systems
In this paper, we study the following version of the Travelling Salesperson Problem: Find the fastest closed trajectory for a controlled dynamic system such that its output visits all points in a given (finite) set. We present an algorithm that, if the n points are randomly sampled from a uniform distribution, produces an output trajectory the expected duration of which scales within a constant...
متن کاملWeb-Based Implementation of Travelling Salesperson Problem Using Genetic Algorithm
The world is connected through the Internet. As the abundance of Internet users connected into the Web and the popularity of cloud computing research, the need of Artificial Intelligence (AI) is demanding. In this research, Genetic Algorithm (GA) as AI optimization method through natural selection and genetic evolution is utilized. There are many applications of GA such as web mining, load bala...
متن کاملSpatial and contextual factors in human performance on the travelling salesperson problem.
The travelling salesperson problem (TSP) provides a realistic and practical example of a visuo-spatial problem-solving task. In previous research, we have found that the quality of solutions produced by human participants for small TSPs compares well with solutions from a range of computer algorithms. We have proposed that the ability of participants to find solutions reflects the natural prope...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Backbone of the Travelling Salesperson
We study the backbone of the travelling salesperson optimization problem. We prove that it is intractable to approximate the backbone with any performance guarantee, assuming that P6=NP and there is a limit on the number of edges falsely returned. Nevertheless, in practice, it appears that much of the backbone is present in close to optimal solutions. We can therefore often find much of the bac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence and Neuroscience
سال: 2019
ISSN: 1687-5265,1687-5273
DOI: 10.1155/2019/2351591